SERVER WAITING TIMES IN INFINITE SUPPLY POLLING SYSTEMS WITH PREPARATION TIMES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Server waiting times in infinite supply polling systems with preparation times

We consider a system consisting of a single server serving a fixed number of stations. At each station there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queueing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. For the case w...

متن کامل

Server waiting times in infinite supply polling systmes with preparations times

We consider a system consisting of a single server serving a fixed number of stations. At each station there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queueing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. For the case w...

متن کامل

Waiting times in polling systems with various service disciplines

We consider a polling system of N queues Q1, . . . , QN , cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Qi, i = 1, . . . , N , it serves a number of customers according to a certain visit discipline. This discipline is assumed to belong to the class of bran...

متن کامل

Cyclic-type Polling Models with Preparation Times

We consider a system consisting of a server serving in sequence a fixed number of stations. At each station there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waitin...

متن کامل

Sensitivity to Service times in Infinite-server Systems

Abstract The stationary distribution of the number of customers in the infinite-server system with nonPoissonian arrivals is dependent on the form of the service time distribution. In particular, when the interarrival time is a hyperexponential random variable that is more variable than an exponential random variable, the stationary state distribution becomes stochastically less variable, as th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability in the Engineering and Informational Sciences

سال: 2015

ISSN: 0269-9648,1469-8951

DOI: 10.1017/s0269964815000339